Conditional cores and conditional convex hulls of random sets
نویسندگان
چکیده
منابع مشابه
Calculating Uncertainty Intervals from Conditional Convex Sets of Probabilities
In Moral, Campos (1991) and Cano, Moral, Verdegay-L6pez (1991) a new method of con ditioning convex sets of probabilities has been proposed. The result of it is a convex set of non-necessarily normalized probability dis tributions. The normalizing factor of each probability distribution is interpreted as the possibility assigned to it by the conditioning information. From this, it is deduced ...
متن کاملconditional expectation of weak random elements
we prove that the limit of a sequence of pettis integrable bounded scalarly measurable weak random elements, of finite weak norm, with values in the dual of a non-separable banach space is pettis integrable. then we provide basic properties for the pettis conditional expectation, and prove that it is continuous. calculus of pettis conditional expectations in general is very different from the c...
متن کاملConvex Hulls for Random Lines
Consider n i .i .d . random lines in the plane defined by their slope and distance from the origin . The slope is uniformly distributed on (0, 27r] and independent of the distance R from the origin . These lines define a set I of n(n 1)/2 intersection points . It was recently shown by Atallah and Ching and Lee that the cardinality of the convex hull of these intersection points is 0(n), and the...
متن کاملConvex Hulls of Sets in the Plane
The convex hull of a set of points is the smallest convex set containing the points. The convex hull is a fundamental concept in mathematics and computational geometry. Other problems can be reduced to finding the convex hull – for example, halfspace intersection, Delaunay triangulation, Voronoi diagram, etc. An algorithm known as Graham scan [6] achieves an O(n log n) running time. This algori...
متن کاملMatrix Convex Hulls of Free Semialgebraic Sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2019
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2019.05.010